The Tightly Super 2-good-neighbor connectivity and 2-good-neighbor Diagnosability of Crossed Cubes
نویسنده
چکیده
Mass data processing and complex problem solving have higher and higher demands for performance of multiprocessor systems. Many multiprocessor systems have interconnection networks (networks for short) as underlying topologies and a network is usually represented by a graph where nodes represent processors and links represent communication links between processors. The network determines the performance of a multiprocessor system. So study of topological properties of its network is important. However, a system of nodes may be faulty when the system is in operation. The fault diagnosis is used to identify faulty processors in a system. All the faulty nodes are replaced by fault-free nodes after a system has been diagnosed. The diagnosability of a system is the maximum number of faulty nodes that can be found during the fault diagnosis. For a diagnosable system, Dahbura and Masson [2] proposed an algorithm with time complex 2.5 ( ) O n , which can effectively
منابع مشابه
The tightly super 3-extra connectivity and 3-extra diagnosability of crossed cubes
Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. In 2016, Zhang et al. proposed the g-extra diagnosability of G, which restrains that every component of G − S has at least (g + 1) vertices. As an important...
متن کاملThe g-Good-Neighbor Conditional Diagnosability of Locally Twisted Cubes
In the work of Peng et al. in 2012, a new measure was proposed for fault diagnosis of systems: namely, g-good-neighbor conditional diagnosability, which requires that any faultfree vertex has at least g fault-free neighbors in the system. In this paper, we establish the g-good-neighbor conditional diagnosability of locally twisted cubes under the PMC model and the MM∗ model.
متن کاملFault diagnosability of data center networks
The data center networks Dn,k, proposed in 2008, has many desirable features such as high network capacity. A kind of generalization of diagnosability for network G is g-goodneighbor diagnosability which is denoted by tg(G). Let κ (G) be the R-connectivity. Lin et. al. in [IEEE Trans. on Reliability, 65 (3) (2016) 1248–1262] and Xu et. al in [Theor. Comput. Sci. 659 (2017) 53–63] gave the same ...
متن کاملSome Properties of the g-Good-Neighbor (g-Extra) Diagnosability of a Multiprocessor System
Diagnosability of a multiprocessor system is one important study topic. In 2012, Peng et al. proposed a measure for fault tolerance of the system, which is called the g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. In 2015, Zhang et al. proposed a measure for fault diagnosis of the system, namely, g-extra diagnosability, which rest...
متن کاملThe Tightly Super 3-Extra Connectivity and Diagnosability of Locally Twisted Cubes
Diagnosability of a multiprocessor system G is one important measure of the reliability of interconnection networks. In 2016, Zhang et al. proposed the g-extra diagnosability of G, which restrains that every component of G S − has at least ( ) 1 g + vertices. The locally twisted cube n LTQ is applied widely. In this paper, we show that n LTQ is tightly ( ) 4 9 n − super 3-extra connected for 6 ...
متن کامل